CHERI Concentrate: Practical Compressed Capabilities
نویسندگان
چکیده
منابع مشابه
Practical Compressed Document Retrieval
Recent research on document retrieval for general texts has established the virtues of explicitly representing the so-called document array, which stores the document each pointer of the suffix array belongs to. While it makes document retrieval faster, this array occupies a significative amount of redundant space and is not easily compressible. In this paper we present the first practical prop...
متن کاملPractical Compressed Suffix Trees
The suffix tree is an extremely important data structure in bioinformatics. Classical implementations require much space, which renders them useless to handle large sequence collections. Recent research has obtained various compressed representations for suffix trees, with widely different space-time tradeoffs. In this paper we show how the use of range min-max trees yields novel representation...
متن کاملPractical compressed string dictionaries
The need to store and query a set of strings – a string dictionary – arises in many kinds of applications. While classically these string dictionaries have accounted for a small share of the total space budget (e.g., in Natural Language Processing or when indexing text collections), recent applications in Web engines, Semantic Web (RDF) graphs, Bioinformatics, and many others, handle very large...
متن کاملCapsicum: Practical Capabilities for UNIX
Capsicum is a lightweight operating system capability and sandbox framework planned for inclusion in FreeBSD 9. Capsicum extends, rather than replaces, UNIX APIs, providing new kernel primitives (sandboxed capability mode and capabilities) and a userspace sandbox API. These tools support the compartmentalization of monolithic UNIX applications into logical applications. We demonstrate our appro...
متن کاملPractical Entropy-Compressed Rank/Select Dictionary
Rank/Select dictionaries are data structures for an ordered set S f0; 1; : : : ; n 1g to compute rank(x; S) (the number of elements in S which are no greater than x), and select(i; S) (the i-th smallest element in S), which are the fundamental components of succinct data structures of strings, trees, graphs, etc. In those data structures, however, only asymptotic behavior has been considered an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Computers
سال: 2019
ISSN: 0018-9340,1557-9956,2326-3814
DOI: 10.1109/tc.2019.2914037